application of montgomery modular multiplication in three factoring algorithm 模乘在3种分解算法中的应用
modular exponentiation and modular multiplication are the basic algorithms for implementing the public key algorithms such as rsa, etc . however the time-consuming modulo exponentiation computation, which has always been the bottle-neck of rsa, restricts its wider application 大数模幂乘运算是实现rsa等公钥密码的基本运算,该算法存在的问题是在实现时耗时太多,这也是制约其广泛应用的瓶颈。
a method called montgomery modular multiplication is the most significant way of fast modular multiplication . the montgomery method and its improvements are studied and the performances are analyzed in this thesis 对于加快模乘法速度的方法,本文重点分析peterl.montgomery提出的及其改进算法,介绍和比较了montgomery模乘算法实现上的分类,找出了较为优越的应用于通用处理器上的montgomery模乘算法。
a method called montgomery modular multiplication is the most significant way of fast modular multiplication . the montgomery method and its improvements are studied and the performances are analyzed in this thesis 对于加快模乘法速度的方法,本文重点分析peterl.montgomery提出的及其改进算法,介绍和比较了montgomery模乘算法实现上的分类,找出了较为优越的应用于通用处理器上的montgomery模乘算法。
this thesis, focused on the large integer modular computations, studies the two ways to reduce the time consumed by modular exponentiation---algorithms for fast modular multiplication and algorithms for computing powers with the least numbers of modular multiplication 本文对数据加密体制用到的大整数模运算进行研究。我们的工作分为两个部分:一部分是对大整数快速模运算算法的分析、研究;另一部分是大整数快速模运算算法的实现。